External reachability (reachability with pole assignment by p. d. feedback) for implicit descriptions
نویسندگان
چکیده
Even for flat implicit linear systems (i. e. having more state components than state equations), reachability is a well defined concept in terms of the set of state trajectories: it characterizes the property that from any initial state can start a smooth state trajectory which reaches any final state. What can happen, however, for this general class of systems, is that a system with no control input can be completely reachable. We introduce here the notion of "external reachability" which expresses the fact that trajectories can actually be controlled through the input (by proportional and derivative state feedback). Geometric necessary and sufficient conditions are given for external reachability. A new design method is proposed for pole assignment which uses this concept and relies upon right inversion techniques.
منابع مشابه
Comments on "some Results on Pole-placement and Reachability"*
We present various comments on a question about systems over rings posed in a recent note by Sharma, proving that a ring R is pole-assignable if and only if, for every reachable system (F,G), G contains a rank-one summand of the state space. We also provide a generalization to deal with dynamic feedback.
متن کاملEvaluation of the reachability subspace of general form polynomial matrix descriptions (PMDs)
We consider the concept of Reachability for systems described by PMDs, generalizing various known results from the theory of generalized state space systems using time domain analysis,which takes into account the finite and infinite pole-zero structure of the associated matrix. We extend also the theory of admissible initial conditions and we introduce the concept of Reachable subspace for PMDs...
متن کاملPole Assignment Of Linear Discrete-Time Periodic Systems In Specified Discs Through State Feedback
The problem of pole assignment, also known as an eigenvalue assignment, in linear discrete-time periodic systems in discs was solved by a novel method which employs elementary similarity operations. The former methods tried to assign the points inside the unit circle while preserving the stability of the discrete time periodic system. Nevertheless, now we can obtain the location of eigenvalues ...
متن کاملReachability checking in complex and concurrent software systems using intelligent search methods
Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...
متن کاملOn the Control of Linear Systems Having Internal Variations, Part I-reachability
Non square implicit descriptions can be used for modelling a set of linear systems, characterized by a certain common structure. Necessary and sufficient conditions, expressed in terms of the overall implicit model, exist for controlling it so that it has a unique behaviour (whatever be the internal structure variations). We enhance from these conditions the parts which are due to the common in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Kybernetika
دوره 29 شماره
صفحات -
تاریخ انتشار 1993